Graph encoding of 2D-gon tilings
نویسندگان
چکیده
2D-gon tilings with parallelograms are a model used in physics to study quasicrystals, and they are also important in combinatorics for the study of aperiodic structures. In this paper, we study the graph induced by the adjacency relation between tiles. This relation can been used to encode simply and efficiently 2D-gon tilings for algorithmic manipulation. We show for example how it can be used to sample random 2D-gon tilings.
منابع مشابه
Integer Partitions, Tilings of 2D-gons and Lattices
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2D-gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2D-gon is the disjoint union of distributive lattices which we describe. We also discuss...
متن کاملTiling with Regular Star Polygons
The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or the faces of the polyhedron, are regular polygons, and that the vertices form a single orbit under the symmetries of the tiling or polyhedron. (Grünbaum and Shephard [1] use Archimedean, in relation to tilings, to refer to the sequence of polygons at each ve...
متن کاملRhombic Tilings of Polygons and Classes of Reduced Words in Coxeter Groups
In the standard Coxeter presentation, the symmetric group Sn is generated by the ad jacent transpositions (1,2), (2,3), ... , (n1,n). For any given permutation, we consider all minimal-length factorizations thereof as a product of the generators. Any two transpositions (i,i+1) and (j,j+1) commute if the numbers i and j are not consecutive; thus, in any factorization, their order can be switche...
متن کاملDistances on Lozenge Tilings
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower bound for the flipdistance (i.e. the number of necessary local transformations involving three lozenges) between two given tilings. It is here proven that, for n ≤ 4, the flip-distance between two tilings is equal to t...
متن کاملPrincipal minors and rhombus tilings
The algebraic relations between the principal minors of an n× n matrix are somewhat mysterious, see e.g. [LS09]. We show, however, that by adding in certain almost principal minors, the relations are generated by a single relation, the so-called hexahedron relation, which is a composition of six cluster mutations. We give in particular a Laurent-polynomial parameterization of the space of n× n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 346 شماره
صفحات -
تاریخ انتشار 2005